منابع مشابه
Partial Parsing via Finite-state Cascades 1 Finite-state Cascades
Finite-state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers speciied by nite-state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with nite feature structures. Finally, such deterministic parsers do not necessarily involve trading oo accuracy against speed| they may in fact be more accurate than ex...
متن کاملPartial parsing via finite-state cascades
Finite-state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite-state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers do not necessarily involve trading off accuracy against speed—they may in fact be more accurate th...
متن کاملIncremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at the sentence level in an incremental way, depending on the contex-tual information available at a given stage. This approach overcomes the inefficiency of previous fully reductionist constraint-based systems, while mai...
متن کاملSchematic Finite-State Intersection Parsing
The framework of Finite-State Intersection Grammars employs a parsing technique according to which several finite-state automata are intersected to determine the output automaton. Implementation of the intersection parser has turned out to be a difficult task. Several problems in efficiency arise when disambiguation choices are based on long contexts with many don’t cares. We are concerned with...
متن کاملFinite-State Parsing And Disambiguation
A languageindependent method of finitestate surface syntactic parsing and word-disambiguation is discussed. Input sentences are represented as finite-state networks already containing all possible roles and interpretations of its units. Also syntactic constraint rules are represented as finite-state machines where each constraint excludes certain types of ungrammatical readings. The whole gramm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Language Engineering
سال: 1996
ISSN: 1351-3249,1469-8110
DOI: 10.1017/s1351324997001599